package cn.crce.cloud9.simple;

/**
 * @author OnCloud9
 * @description
 * @project NRCE-TEST
 * @date 2022年09月10日 上午 08:34
 */
public class Case6 {
    public static void main(String args[]) {
        //*********Found**********
        int a[][] = new int[5][5];
        int i, j, k = 1;
        for (i = 0; i < 5; i++)
            for (j = 0; j < 5; j++)
                if ((i + j) < 5) {
                    a[i][j] = k;
                    //*********Found**********
                    k++;
                    if (k > 9) k = 1;
                } else
                    //*********Found**********
                    a[i][j] = 0;
        for (i = 0; i < 5; i++) {
            for (j = 0; j < 5; j++)
                System.out.print(a[i][j] + "   ");
            //*********Found**********
            System.out.println();
        }
    }
}
